Transfinite induction within Peano arithmetic

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Transfinite Induction within Peano Arithmetic

The relative strengths of first-order theories axiomatized by transfinite induction, for ordinals less-than ~0, and formulas restricted in quantifier complexity, is determined. This is done, in part, by describing the provably recursive functions of such theories. Upper bounds for the provably recursive functions are obtained using model-theoretic techniques. A variety of additional results tha...

متن کامل

Peano Arithmetic

The project is designed for an upper level undergraduate course in mathematical logic. Although the project is relatively short, some of the exercises are not as easy as they appear. Instructors may wish to spend some class time on discussing how formal proofs should be conducted, and also provide some additional assistance with completing some of the exercises. The last part of the project ass...

متن کامل

Interpretability over Peano Arithmetic

We investigate the modal logic of interpretability over Peano arith metic PA Our main result is an extension of the arithmetical complete ness theorem for the interpretability logic ILM This extension concerns recursively enumerable sets of formulas of interpretability logic rather than single formulas As corollaries we obtain a uniform arithmetical completeness theorem for the interpretability...

متن کامل

Interpretability suprema in Peano Arithmetic

This paper develops the philosophy and technology needed for adding a supremum operator to the interpretability logic ILM of Peano Arithmetic (PA). It is wellknown that any theories extending PA have a supremum in the interpretability ordering. While provable in PA, this fact is not reflected in the theorems of the modal system ILM, due to limited expressive power. Our goal is to enrich the lan...

متن کامل

Non-Commutative Infinitary Peano Arithmetic

Does there exist any sequent calculus such that it is a subclassical logic and it becomes classical logic when the exchange rules are added? The first contribution of this paper is answering this question for infinitary Peano arithmetic. This paper defines infinitary Peano arithmetic with non-commutative sequents, called non-commutative infinitary Peano arithmetic, so that the system becomes eq...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annals of Pure and Applied Logic

سال: 1995

ISSN: 0168-0072

DOI: 10.1016/0168-0072(95)00029-g